Clustering with local restrictions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering with Local Restrictions

We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let μ be a function on the subsets of vertices of a graph G. In the (μ, p, q)-Partition problem, the task is to find a partition of the vertices into clusters where each cluster C satisfies the requirements that (1) at most q edges leave C and (2) μ(C) ≤ p. Our first result sh...

متن کامل

Absorption for ABoxes with Local Universal Restrictions

We elaborate on earlier work in which we developed a novel method for evaluating instance queries over DL knowledge bases that derives from binary absorption. An important feature of this earlier method and its refinement in this paper is that they avoid the need to check explicitly for consistency, a property that is desirable, for example, in SPARQL query evaluation over RDF data sets that ca...

متن کامل

Enumeration by Stabilizer Class of Patterns with Local Restrictions

We consider patterns of colourings of G-sets where certain forbidden sub-colourings are excluded. An algorithm is developed for the calculation of inventories of patterns with a prescribed stabilizer class.

متن کامل

Derandomizing Local Distributed Algorithms under Bandwidth Restrictions

This paper addresses the cornerstone family of local problems in distributed computing, and investigates the curious gap between randomized and deterministic solutions under bandwidth restrictions. Our main contribution is in providing tools for derandomizing solutions to local problems, when the n nodes can only send O(log n)-bit messages in each round of communication. We combine bounded inde...

متن کامل

Local Semiparametric Efficiency Bounds under Shape Restrictions

Consider the model y 5 xb0 1 f *~z! 1 «, where « 5 d N~0,s0!+ We calculate the smallest asymptotic variance that n102 consistent regular ~n102CR! estimators of b0 can have when the only information we possess about f * is that it has a certain shape+ We focus on three particular cases: ~i! when f * is homogeneous of degree r, ~ii! when f * is concave, ~iii! when f * is decreasing+ Our results s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2013

ISSN: 0890-5401

DOI: 10.1016/j.ic.2012.10.016